Maximal set

Results: 92



#Item
41The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Language: English - Date: 2013-05-11 13:53:39
42OPTIMAL TRIANGULATIONS Introduction. A triangulation of a given set S of n points in the Euclidean plane is a maximal set of non-crossing straight line segments (called edges) which have both endpoints in S. As an equiva

OPTIMAL TRIANGULATIONS Introduction. A triangulation of a given set S of n points in the Euclidean plane is a maximal set of non-crossing straight line segments (called edges) which have both endpoints in S. As an equiva

Add to Reading List

Source URL: www.igi.tugraz.at

Language: English - Date: 2016-02-13 09:27:27
    43Maximal surface area of a convex set in Rn with respect to exponential rotation invariant measures

    Maximal surface area of a convex set in Rn with respect to exponential rotation invariant measures

    Add to Reading List

    Source URL: www.math.kent.edu

    Language: English - Date: 2014-08-25 14:48:16
      44Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California

      Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California

      Add to Reading List

      Source URL: crd.lbl.gov

      Language: English - Date: 2013-03-15 00:51:18
      45Parallel Triangle Counting and Enumeration using Matrix Algebra Ariful Azad1 , Aydın Buluc¸1 , John Gilbert2 E-mail: , , and 1 Lawrence

      Parallel Triangle Counting and Enumeration using Matrix Algebra Ariful Azad1 , Aydın Buluc¸1 , John Gilbert2 E-mail: , , and 1 Lawrence

      Add to Reading List

      Source URL: gauss.cs.ucsb.edu

      Language: English - Date: 2015-05-18 17:48:42
      46MAXIMAL SURFACE AREA OF POLYTOPES WITH RESPECT TO LOG-CONCAVE ROTATION INVARIANT MEASURES. GALYNA LIVSHYTS Abstract. It was shown in [21] that the maximal surface area of a convex set in Rn with respect to a rotation

      MAXIMAL SURFACE AREA OF POLYTOPES WITH RESPECT TO LOG-CONCAVE ROTATION INVARIANT MEASURES. GALYNA LIVSHYTS Abstract. It was shown in [21] that the maximal surface area of a convex set in Rn with respect to a rotation

      Add to Reading List

      Source URL: www.math.kent.edu

      Language: English - Date: 2014-09-15 15:23:33
        47

        PDF Document

        Add to Reading List

        Source URL: security.cs.georgetown.edu

        Language: English - Date: 2014-07-11 14:03:09
        48Chapter 10 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In

        Chapter 10 Maximal Independent Set In this chapter we present a highlight of this course, a fast maximal independent set (MIS) algorithm. The algorithm is the first randomized algorithm that we study in this class. In

        Add to Reading List

        Source URL: dcg.ethz.ch

        - Date: 2014-09-26 08:29:08
          49Qualifying exam, Spring 2006, DayLet φ : A → B be a homomorphism of commutative rings, and let pB ⊂ B be a maximal ideal. Set A ⊃ pA := φ−1 (pB ). (a) Show that pA is prime but in general non maximal. (b

          Qualifying exam, Spring 2006, DayLet φ : A → B be a homomorphism of commutative rings, and let pB ⊂ B be a maximal ideal. Set A ⊃ pA := φ−1 (pB ). (a) Show that pA is prime but in general non maximal. (b

          Add to Reading List

          Source URL: www.math.harvard.edu

          Language: English - Date: 2006-02-02 22:49:40
            50BRICS Basic Research in Computer Science BRICS RSBrodal et al.: Finding Maximal Pairs with Bounded Gap Finding Maximal Pairs with Bounded Gap

            BRICS Basic Research in Computer Science BRICS RSBrodal et al.: Finding Maximal Pairs with Bounded Gap Finding Maximal Pairs with Bounded Gap

            Add to Reading List

            Source URL: www.brics.dk

            Language: English - Date: 1999-06-28 05:16:54